Learning from examples with unspecified attribute values
نویسندگان
چکیده
منابع مشابه
Learning from examples with unspecified attribute values
We introduce the UAV learning model in which some of the attributes in the examples are unspecified. In our model, an example x is classified positive (resp., negative) if all possible assignments for the unspecified attributes result in a positive (resp., negative) classification. Otherwise the classificatoin given to x is "?" (for unknown). Given an example x in which some attributes are unsp...
متن کاملOn the Unknown Attribute Values in Learning from Examples
In machine learning many real-life applications data are characterized by attributes with unknown values. This paper shows that the existing approaches to learning from such examples are not sufficient. A new method is suggested, which transforms the original decision table with unknown values into a new decision table in which every attribute value is known. Such a new table, in general, is in...
متن کاملLearning to Extract Attribute Values from a Search Engine with Few Examples
We propose an attribute value extraction method based on analysing snippets from a search engine. First, a pattern based detector is applied to locate the candidate attribute values in snippets. Then a classifier is used to predict whether a candidate value is correct. To train such a classifier, only very few annotated triples are needed, and sufficient training data...
متن کاملReconciling Attribute Values from Multiple Data Sources
Because of the heterogeneous nature of multiple data sources, data integration is often one of the most challenging tasks of today’s information systems. While the existing literature has focused on problems such as schema integration and entity identification, our current study attempts to answer a basic question: When an attribute value for a real-world entity is recorded differently in two d...
متن کاملLearning functions from examples
This paper concerns algorithms that "learn functions from examples. Functions on strings of a finite alphabet are considered and the notion of dimensionality defined for families of such functions. Using this notion, a theorem is proved identifying the most general conditions under which a family of functions can be efficiently learned from examples. Turning to some familiar families: we presen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2003
ISSN: 0890-5401
DOI: 10.1016/s0890-5401(02)00030-5